Satisfiability Modulo Theories Clark Barrett and Cesare Tinelli Abstract Satisfiability Modulo Theories (SMT) refers to the problem of determining whether a first-order formula is satisfiable with respect to some logical

Source URL: www.lsv.ens-cachan.fr

Proofs in Satisfiability Modulo Theories Pascal Fontaine (Inria, Loria, U. Lorraine) SAT/SMT Summer School 2015 Stanford

Source URL: www.cs.nyu.edu

Journal on Satisfiability, Boolean Modeling and ComputationUniversal Guards, Relativization of Quantifiers, and Failure Models in Model Checking Modulo Theories Francesco Alberti

Source URL: jsat.ewi.tudelft.nl

Microsoft Word - BlankPage

Source URL: www.cs.miami.edu

• Logic
• Abstraction
• Philosophy
• Automated theorem proving
• Reasoning
• Formal methods
• Predicate logic
• Datalog
• First-order logic
• Axiom
• Satisfiability modulo theories
• Mereology

Automatic Proof and Disproof in Isabelle/HOL Jasmin Christian Blanchette, Lukas Bulwahn, and Tobias Nipkow Fakult¨at f¨ur Informatik, Technische Universit¨at M¨unchen Abstract. Isabelle/HOL is a popular interactive t

Source URL: people.mpi-inf.mpg.de

• Theoretical computer science
• Software engineering
• Programming language theory
• Logic in computer science
• Proof assistants
• Formal methods
• Automated theorem proving
• Isabelle
• Satisfiability modulo theories
• ACL2
• Curry
• Logic for Computable Functions

International Conference on Automated Planning and Scheduling (ICAPSTask and Motion Policy Synthesis as Liveness Games Yue Wang and Neil T. Dantam and Swarat Chaudhuri and Lydia E. Kavraki Department of Computer

Source URL: www.neil.dantam.name

• Theoretical computer science
• Robot kinematics
• Constraint programming
• NP-complete problems
• Motion planning
• Pursuit-evasion
• Satisfiability modulo theories
• Automated planning and scheduling
• Liveness

TIP: Tons of Inductive Problems Koen Claessen, Moa Johansson, Dan Ros´en, and Nicholas Smallbone Department of Computer Science and Engineering, Chalmers University of Technology {koen,jomoa,danr,nicsma}@chalmers.se Ab

Source URL: www.cse.chalmers.se

• Software engineering
• Theoretical computer science
• Automated theorem proving
• Mathematics
• Logic in computer science
• Functional languages
• Formal methods
• Reasoning
• Satisfiability modulo theories
• Rippling
• Automated reasoning
• IP

Unleashing Mayhem on Binary Code

Source URL: users.ece.cmu.edu

• Theoretical computer science
• Computing
• Software engineering
• Automated theorem proving
• Concolic testing
• Formal methods
• Symbolic execution
• Parallel computing
• Satisfiability modulo theories
• KeY
• Symbolic
• X86

Journal of Automated Reasoning manuscript No. DOIs10817Interpolation Systems for Ground Proofs in Automated Deduction: a Survey Maria Paola Bonacina · Moa Johansson

Source URL: www.cse.chalmers.se

• Mathematical logic
• Logic
• Theoretical computer science
• Automated theorem proving
• Formal methods
• Logic in computer science
• Electronic design automation
• Craig interpolation
• Interpolation
• Satisfiability modulo theories
• Unit propagation
• Resolution

Leveraging SMT: Using SMT Solvers to Improve Verification; Using Verification to Improve SMT Solvers Clark Barrett Christopher L. Conway

Source URL: fm.csl.sri.com

• Theoretical computer science
• Formal methods
• Logic in computer science
• Constraint programming
• Electronic design automation
• NP-complete problems
• Satisfiability modulo theories
• Solver
• SMT
• Uninterpreted function
• Model checking
• Alt-Ergo